Unification and Grammatical Theory

نویسنده

  • Ivan A. Sag
چکیده

This paper informally presents a new view of grammar that has emerged from a number of distinct but related lines of investigation in theoretical and computational linguistics. Under this view, many current linguistic theories-including Lexical-Functional Grammar (LFG), Generalized Phraae Structure Grammar (GPSG), Head-Driven Phrase Structure Grammar (HPSG), and categorial grammar (CG)-fall within a general framework of UNIFICATION GRAMMAR. In such theories the linguistic objects under study are lBSociated with linguistic information about the objects, which information is modeled by mathematical objects called FEATURE STRUCTURES. Linguistic phenomena are modeled by constraints of equality over the feature structures; the fundamental operation upon the feature structures, allowing solution of such systems of equations, is a simple merging of their information content called UNIFICATION.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Unification Encodings of Grammatical Notations

This paper describes various techniques for enriching unification-based grammatical formalisms with notational devices that are compiled into categories and rules of a standard unification grammar. This enables grammarians to avail themselves of apparently richer notations that allow for the succinct and relatively elegant expression of grammatical facts, while still allowing for efficient proc...

متن کامل

Expressing generalizations in unification-based grammar formalisms

This paper shows how higher levels of generalization can be introduced into unification grammars by exploiting methods for typing grammatical objects. We discuss the strategy of using global declarations to limit possible linguistic structures, and sketch a few unusual aspects of our typechecking algorithm. We also describe the sort system we use in our semantic representation language and illu...

متن کامل

Polynomially parsable unification grammars

Unification grammars (UG) are a grammatical formalism that underlies several contemporary linguistic theories, including Lexical-functional Grammar and Head-driven Phrase-structure Grammar. UG is an especially attractive formalism because of its expressivity, which facilitates the expression of complex linguistic structures and relations. Formally, UG is Turing-complete, generating the entire c...

متن کامل

eft-corner Unification-base

In this paper, we present an efficient algorithm for parsing natural language using unification grammars. The algorithm is an extension of left-corner parsing, a bottom-up algorithm which utilizes top-down expectations. The extension exploits unification grammar’s uniform representation of syntactic, semantic, and domain knowledge, by incorporating all types of grammatical knowledge into parser...

متن کامل

Unification encodings of grammat- ical notations1

This paper describes various techniques for enriching unification-based grammatical formalisms with notational devices that are compiled into categories and rules of a standard unification grammar. This enables grammarians to avail themselves of apparently richer notations which allow for the succinct and relatively elegant expression of grammatical facts, while still allowing for efficient pro...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007